Large graph limit for an SIR process in random network with heterogeneous connectivity

نویسندگان

  • Laurent Decreusefond
  • Jean-Stephane Dhersin
  • Pascal Moyal
  • Viet Chi Tran
  • Jean-Stéphane Dhersin
چکیده

We consider a SIR epidemic model propagating on a random network generated by configuration model, where the degree distribution of the vertices is given and where the edges are randomly matched. The evolution of the epidemics is summed up into three measurevalued equations that describe the degrees of the susceptible individuals and the number of edges from an infectious or removed individual to the set of susceptibles. These three degree distributions are sufficient to describe the course of the disease. The limit in large population is investigated. As a corollary, this provides a rigorous proof of the equations obtained by Volz [27].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

Topological Properties of an Exponential Random Geometric Graph Process

In this paper we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process. The transition probability matrix and stationary distribution are derived for the Markov chains concerning connectivity and the number of components. We analyze the algorithm for hitting time regarding disconnectivity. In addition to dynamical ...

متن کامل

Secure Communication in Shotgun Cellular Systems

In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...

متن کامل

SIR dynamics in structured populations with heterogeneous connectivity

Received: September 4, 2005, Revised:February 2, 2008 – c © Springer-Verlag 2008 Abstract. Most epidemic models assume equal mixing among members of a population. An alternative approach is to model a population as a random network in which individuals may have heterogeneous connectivity. This paper builds on previous research by describing the exact dynamical behavior of epidemics as they occu...

متن کامل

Identification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data

Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017